The hazardous orienteering problem

This article studies the Hazardous Orienteering Problem (HOP), a variant of more famous (OP). In OP, vehicle earns profit for each customer it visits (e.g., to pick up parcel) subject an upper bound on tour time. HOP, parcels picked at some customers have probability triggering catastrophic event. The depends how long travel vehicle. If any event triggers, entire collected is lost. goal determine that maximizes expected profit. problem has interesting applications in routing hazardous material, cash-in-transit, and law enforcement. We propose mixed-integer nonlinear formulation techniques both obtain dual bounds produce primal solutions. Computational tests investigate efficacy methods proposed allow gain insights into solution features.